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 listSep 3, 2026 16:07CheckHarryCheckHarryScore: 4,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 16:084,57447,715,58836,946,0001,022,0002,113,536
2Sep 3, 2026 16:084,58047,831,81136,991,0001,029,0002,113,536
3Sep 3, 2026 16:084,58147,824,56537,015,0001,015,0002,113,536
4Sep 3, 2026 16:084,58247,865,26937,023,0001,015,0002,113,536
5Sep 3, 2026 16:084,58347,811,83237,028,0001,015,0002,113,536
6Sep 3, 2026 16:084,58947,920,99837,075,0001,016,0002,113,536
7Sep 3, 2026 16:084,58947,985,51437,076,0001,016,0002,113,536
8Sep 3, 2026 16:084,59848,031,03937,153,0001,015,0002,113,536
9Sep 3, 2026 16:084,77349,502,52938,605,0001,014,0002,113,536