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 listMay 20, 2026 05:55M-RochatM-RochatScore: 12,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:5612,187111,048,465100,149,0001,009,0002,113,536
2May 20, 2026 05:5612,190110,820,92099,911,0001,267,0002,113,536
3May 20, 2026 05:5612,197110,860,55199,967,0001,272,0002,113,536
4May 20, 2026 05:5612,198113,867,812100,235,0001,009,0002,113,536
5May 20, 2026 05:5612,215113,051,661100,376,0001,010,0002,113,536
6May 20, 2026 05:5612,224111,711,691100,457,0001,010,0002,113,536
7May 20, 2026 05:5612,226111,700,995100,210,0001,272,0002,113,536
8May 20, 2026 05:5612,269111,566,84099,816,0002,021,0002,113,536
9May 20, 2026 05:5612,301114,501,293100,083,0002,018,0002,113,536