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 8, 2026 08:53flavio87flavio87Score: 9,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2026 08:549,13993,117,47974,840,0001,019,0002,342,912
2May 8, 2026 08:549,18092,025,09374,094,0002,104,0002,375,680
3May 8, 2026 08:549,18690,987,98074,238,0002,014,0002,355,200
4May 8, 2026 08:549,18691,176,07475,225,0001,019,0002,379,776
5May 8, 2026 08:549,20791,444,53675,392,0001,028,0002,367,488
6May 8, 2026 08:549,20893,101,70675,413,0001,019,0002,379,776
7May 8, 2026 08:549,21792,969,63675,488,0001,019,0002,383,872
8May 8, 2026 08:549,32693,915,55476,391,0001,018,0002,396,160
9May 8, 2026 08:549,33994,552,41676,497,0001,018,0002,379,776