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 listFeb 22, 2026 13:46SneedSneedScore: 73,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:4673,227630,826,400554,804,00052,981,0002,445,312
2Feb 22, 2026 13:4673,368632,264,221557,961,00050,996,0002,277,376
3Feb 22, 2026 13:4673,441639,999,061558,595,00050,963,0002,314,240