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 17, 2026 02:29Andrew EpsteinAndrew EpsteinScore: 3,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:303,38736,813,80527,107,0001,009,0002,113,536
2Sep 17, 2026 02:303,38836,812,84227,104,0001,024,0002,113,536
3Sep 17, 2026 02:303,39236,896,43327,140,0001,017,0002,113,536
4Sep 17, 2026 02:303,39736,854,33927,178,0001,023,0002,113,536
5Sep 17, 2026 02:303,45037,327,83627,618,0001,021,0002,113,536
6Sep 17, 2026 02:303,47437,562,37027,810,0001,029,0002,113,536
7Sep 17, 2026 02:303,50737,795,49228,080,0001,030,0002,113,536
8Sep 17, 2026 02:303,53137,980,42928,288,0001,024,0002,113,536
9Sep 17, 2026 02:303,53838,170,79328,338,0001,031,0002,113,536