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 listJul 12, 2026 17:27Kevin HeaveyKevin HeaveyScore: 5,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 17:315,94959,036,75548,181,0001,200,0002,117,632
2Jul 12, 2026 17:315,95159,065,16548,194,0001,205,0002,117,632
3Jul 12, 2026 17:315,95459,046,27748,405,0001,017,0002,117,632
4Jul 12, 2026 17:315,95859,077,37048,441,0001,013,0002,117,632
5Jul 12, 2026 17:315,96159,118,48348,461,0001,017,0002,117,632
6Jul 12, 2026 17:315,96459,050,29548,287,0001,216,0002,117,632
7Jul 12, 2026 17:315,97659,238,49748,588,0001,018,0002,117,632
8Jul 12, 2026 17:315,97959,302,78048,602,0001,024,0002,117,632
9Jul 12, 2026 17:316,03659,751,14249,079,0001,026,0002,117,632