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 listAug 28, 2026 21:10Victor MerckléVictor MerckléScore: 5,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:105,11551,455,13441,441,0001,018,0002,117,632stderr
2Aug 28, 2026 21:105,11651,506,44341,449,0001,021,0002,117,632stderr
3Aug 28, 2026 21:105,12052,899,01341,475,0001,021,0002,117,632stderr
4Aug 28, 2026 21:105,12451,600,83641,517,0001,020,0002,117,632stderr
5Aug 28, 2026 21:105,12651,567,80941,526,0001,026,0002,117,632stderr
6Aug 28, 2026 21:105,12851,634,96341,545,0001,021,0002,117,632stderr
7Aug 28, 2026 21:105,13151,632,61041,563,0001,032,0002,117,632stderr
8Aug 28, 2026 21:105,15051,792,17541,728,0001,022,0002,117,632stderr
9Aug 28, 2026 21:105,17452,027,94141,906,0001,041,0002,117,632stderr