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 25, 2026 16:13Kenzie_RTKenzie_RTScore: 106,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:13106,412892,512,540788,804,00094,419,0002,113,536
2May 25, 2026 16:13106,414892,732,343788,745,00094,498,0002,113,536
3May 25, 2026 16:13106,565893,775,826789,280,00095,210,0002,113,536
4May 25, 2026 16:13106,928897,562,130790,304,00097,200,0002,113,536
5May 25, 2026 16:13106,994900,301,305789,578,00098,476,0002,113,536
6May 25, 2026 16:13107,053898,947,707789,420,00099,123,0002,113,536
7May 25, 2026 16:13107,192898,971,736790,180,00099,521,0002,113,536
8May 25, 2026 16:13107,292901,217,924790,341,000100,189,0002,113,536
9May 25, 2026 16:13107,492902,403,815790,114,000102,072,0002,113,536