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 06:07CheckHarryCheckHarryScore: 5,132Success
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 06:075,06351,862,12740,010,0002,018,0002,113,536
2Sep 3, 2026 06:075,06651,899,51741,031,0001,024,0002,113,536
3Sep 3, 2026 06:075,09352,022,15140,266,0002,007,0002,113,536
4Sep 3, 2026 06:075,10653,589,72040,349,0002,031,0002,113,536
5Sep 3, 2026 06:075,13252,334,97641,579,0001,024,0002,113,536
6Sep 3, 2026 06:075,13352,419,53141,588,0001,023,0002,113,536
7Sep 3, 2026 06:075,15952,663,12140,781,0002,041,0002,113,536
8Sep 3, 2026 06:075,16152,611,58640,792,0002,045,0002,113,536
9Sep 3, 2026 06:075,25553,496,26941,614,0002,003,0002,113,536