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 17, 2026 01:57M-RochatM-RochatScore: 12,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:5712,661115,804,462102,904,0002,190,0002,113,536
2May 17, 2026 01:5712,713114,437,695103,376,0002,150,0002,113,536
3May 17, 2026 01:5712,739116,160,207102,507,0003,234,0002,113,536
4May 17, 2026 01:5712,741116,354,009102,575,0003,176,0002,113,536
5May 17, 2026 01:5712,745114,634,822102,610,0003,180,0002,113,536
6May 17, 2026 01:5712,747115,103,021102,599,0003,208,0002,113,536
7May 17, 2026 01:5712,747115,229,323102,630,0003,176,0002,113,536
8May 17, 2026 01:5712,793115,280,497102,894,0003,290,0002,113,536
9May 17, 2026 01:5712,795114,956,390102,980,0003,225,0002,113,536