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 17, 2026 19:16wnwnScore: 7,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:166,33477,402,20550,550,0002,022,0002,461,696
2Feb 17, 2026 19:166,35681,145,00950,768,0001,990,0002,506,752
3Feb 17, 2026 19:166,37578,610,68550,915,0001,996,0002,269,184
4Feb 17, 2026 19:167,36482,659,11158,118,0003,006,0002,437,120
5Feb 17, 2026 19:167,46288,364,06658,935,0002,996,0002,400,256
6Feb 17, 2026 19:167,52686,238,98860,454,0002,015,0002,375,680