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 3, 2026 18:14boop34boop34Score: 9,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 18:149,01284,551,42073,699,0001,104,0002,113,536
2Aug 3, 2026 18:149,05384,957,34874,020,0001,120,0002,113,536
3Aug 3, 2026 18:149,05485,047,85074,049,0001,105,0002,113,536
4Aug 3, 2026 18:149,05884,985,13974,063,0001,125,0002,113,536
5Aug 3, 2026 18:149,06084,986,87574,000,0001,203,0002,113,536
6Aug 3, 2026 18:149,07385,128,40474,129,0001,179,0002,113,536
7Aug 3, 2026 18:149,07485,318,97474,107,0001,211,0002,113,536
8Aug 3, 2026 18:149,07985,300,76074,228,0001,130,0002,113,536
9Aug 3, 2026 18:149,09185,377,12974,250,0001,212,0002,113,536