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 listSep 27, 2026 03:33mkmkScore: 98,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 03:3398,004824,896,640753,892,00059,542,0002,113,536
2Sep 27, 2026 03:3398,076825,264,387754,003,00060,028,0002,113,536
3Sep 27, 2026 03:3398,097825,400,652754,173,00060,037,0002,113,536