Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 9, 2026 18:31AVGAVGScore: 47,482Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:3146,726414,529,114385,828,0001,999,0002,277,376
2Jan 9, 2026 18:3147,426419,321,772393,635,00002,277,376
3Jan 9, 2026 18:3147,448420,519,298392,821,000999,0002,277,376
4Jan 9, 2026 18:3147,457417,085,903392,892,000999,0002,277,376
5Jan 9, 2026 18:3147,482415,987,848393,100,0001,000,0002,277,376
6Jan 9, 2026 18:3147,487417,030,172393,145,0001,000,0002,400,256
7Jan 9, 2026 18:3147,498421,510,366393,237,0001,000,0002,404,352
8Jan 9, 2026 18:3147,523422,546,381392,444,0001,997,0002,396,160
9Jan 9, 2026 18:3147,570418,051,730392,831,0001,999,0002,408,448