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 30, 2026 00:00olliecrowolliecrowScore: 6,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 00:006,19568,034,27348,398,0003,024,0002,490,368
2Apr 30, 2026 00:006,23270,809,81948,748,0002,984,0002,473,984
3Apr 30, 2026 00:006,27773,437,19948,095,0004,007,0002,387,968
4Apr 30, 2026 00:006,29368,068,04249,225,0003,013,0002,314,240
5Apr 30, 2026 00:006,31867,019,91749,418,0003,025,0002,428,928
6Apr 30, 2026 00:006,31968,282,58649,427,0003,026,0002,433,024
7Apr 30, 2026 00:006,35867,220,33149,790,0002,987,0002,486,272
8Apr 30, 2026 00:006,36868,464,11348,867,0003,989,0002,396,160
9Apr 30, 2026 00:006,37370,675,44248,911,0003,992,0002,498,560