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 listApr 4, 2026 20:03zielajzielajScore: 4,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2026 20:053,44555,392,69227,574,0001,021,0002,519,040
2Apr 4, 2026 20:053,45056,224,06027,614,0001,022,0002,433,024
3Apr 4, 2026 20:053,47853,379,70726,879,0001,991,0002,433,024
4Apr 4, 2026 20:034,14557,678,96833,389,0001,011,0002,510,848
5Apr 4, 2026 20:034,16154,444,31933,525,0001,015,0002,519,040
6Apr 4, 2026 20:034,29159,430,19634,600,0001,017,0002,433,024