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 29, 2026 13:06olliecrowolliecrowScore: 15,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:0715,255143,067,131122,598,0004,019,0002,527,232
2Apr 29, 2026 13:0715,261143,221,730121,683,0004,987,0002,543,616
3Apr 29, 2026 13:0715,283145,550,402123,858,0002,996,0002,424,832
4Apr 29, 2026 13:0715,297145,660,222123,968,0002,999,0002,490,368
5Apr 29, 2026 13:0715,337143,658,085123,294,0004,009,0002,428,928
6Apr 29, 2026 13:0715,337143,137,307119,285,0008,019,0002,301,952
7Apr 29, 2026 13:0715,342143,693,084121,326,0006,016,0002,334,720
8Apr 29, 2026 13:0715,528146,219,516121,893,0006,993,0002,543,616
9Apr 29, 2026 13:0715,882149,966,476127,834,0003,994,0002,469,888