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 11, 2026 08:00wnwnScore: 3,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 08:003,78239,176,75030,334,0001,063,0002,113,536
2May 11, 2026 08:003,78238,642,44730,342,0001,053,0002,113,536
3May 11, 2026 08:003,78238,903,31830,326,0001,067,0002,113,536
4May 11, 2026 08:003,78242,157,02230,341,0001,057,0002,113,536
5May 11, 2026 08:003,78339,927,69930,277,0001,127,0002,113,536
6May 11, 2026 08:003,78341,125,92930,364,0001,042,0002,113,536
7May 11, 2026 08:003,78338,957,30530,334,0001,070,0002,113,536
8May 11, 2026 08:003,78341,233,04530,341,0001,059,0002,113,536
9May 11, 2026 08:003,78441,050,73330,331,0001,080,0002,113,536