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 listAug 21, 2026 03:55Andrew EpsteinAndrew EpsteinScore: 4,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 03:563,89440,736,42330,298,0002,029,0002,113,536
2Aug 21, 2026 03:563,90140,706,10630,333,0002,048,0002,113,536
3Aug 21, 2026 03:563,92740,914,76630,563,0002,039,0002,113,536
4Aug 21, 2026 03:563,95341,153,50130,726,0002,084,0002,113,536
5Aug 21, 2026 03:564,01741,696,54431,266,0002,082,0002,113,536
6Aug 21, 2026 03:564,02641,869,46731,332,0002,085,0002,113,536
7Aug 21, 2026 03:564,04141,859,66531,448,0002,098,0002,113,536
8Aug 21, 2026 03:564,05443,304,43131,549,0002,103,0002,113,536
9Aug 21, 2026 03:564,07242,128,73631,691,0002,113,0002,113,536