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:33M-RochatM-RochatScore: 39,438Success
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:3339,360338,421,884325,692,0001,004,0002,113,536
2May 20, 2026 05:3339,402338,678,168326,040,0001,003,0002,113,536
3May 20, 2026 05:3339,421339,589,932325,178,0002,021,0002,113,536
4May 20, 2026 05:3339,425336,726,625325,965,0001,264,0002,113,536
5May 20, 2026 05:3339,438339,236,331326,333,0001,003,0002,113,536
6May 20, 2026 05:3339,498339,333,674326,837,0001,003,0002,113,536
7May 20, 2026 05:3339,563341,289,763327,370,0001,003,0002,113,536
8May 20, 2026 05:3339,583340,256,907326,503,0002,041,0002,113,536
9May 20, 2026 05:3340,562346,403,098335,408,0001,264,0002,113,536