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 listSep 5, 2026 13:06wnwnScore: 3,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:083,65338,808,07929,322,0001,004,0002,113,536
2Sep 5, 2026 13:083,65640,388,17729,341,0001,010,0002,113,536
3Sep 5, 2026 13:083,65938,827,82429,363,0001,011,0002,113,536
4Sep 5, 2026 13:083,66038,812,71729,371,0001,009,0002,113,536
5Sep 5, 2026 13:083,66438,876,31729,408,0001,004,0002,113,536
6Sep 5, 2026 13:083,67938,940,55429,512,0001,025,0002,113,536
7Sep 5, 2026 13:083,78940,533,46830,438,0001,013,0002,113,536
8Sep 5, 2026 13:083,85241,139,35730,882,0001,095,0002,113,536
9Sep 5, 2026 13:083,87341,319,11331,112,0001,041,0002,113,536