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 listApr 10, 2026 10:44Danylo MocherniukDanylo MocherniukScore: 6,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:445,87771,339,81445,792,0002,986,0002,396,160
2Apr 10, 2026 10:445,93570,440,24948,257,0001,005,0002,502,656
3Apr 10, 2026 10:445,95870,278,45647,436,0002,018,0002,396,160
4Apr 10, 2026 10:445,97581,341,14647,572,0002,024,0002,338,816
5Apr 10, 2026 10:445,98078,113,74447,610,0002,025,0002,379,776
6Apr 10, 2026 10:445,98078,455,65046,592,0003,038,0002,297,856
7Apr 10, 2026 10:446,00578,796,00346,853,0002,990,0002,379,776
8Apr 10, 2026 10:446,01672,867,34946,936,0002,995,0002,383,872
9Apr 10, 2026 10:446,01771,111,39446,949,0002,996,0002,297,856
10Apr 10, 2026 10:446,01974,399,77048,957,000999,0002,297,856
11Apr 10, 2026 10:446,14276,640,80848,977,0001,999,0002,392,064
12Apr 10, 2026 10:446,26480,930,83849,993,0001,999,0002,392,064