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 listMar 18, 2026 03:32Yuriy LyfenkoYuriy LyfenkoScore: 4,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 03:324,66264,154,31737,673,0001,018,0002,478,080
2Mar 18, 2026 03:324,66966,105,76537,761,000993,0002,473,984
3Mar 18, 2026 03:324,67464,804,08737,804,000994,0002,473,984
4Mar 18, 2026 03:324,67761,321,77437,822,000995,0002,531,328
5Mar 18, 2026 03:324,69465,418,67836,965,0001,998,0002,465,792
6Mar 18, 2026 03:324,71564,795,82937,130,0002,007,0002,531,328
7Mar 18, 2026 03:324,92566,997,05938,883,0001,994,0002,469,888
8Mar 18, 2026 03:324,93373,512,12938,948,0001,997,0002,281,472
9Mar 18, 2026 03:324,93665,659,10938,969,0001,998,0002,531,328