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 6, 2026 03:14CheckHarryCheckHarryScore: 7,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:167,03568,212,64857,385,0001,006,0002,113,536
2Sep 6, 2026 03:167,03968,214,85757,421,0001,005,0002,113,536
3Sep 6, 2026 03:167,04568,385,35257,475,0001,005,0002,113,536
4Sep 6, 2026 03:167,04668,348,06357,480,0001,004,0002,113,536
5Sep 6, 2026 03:167,05068,414,34857,514,0001,008,0002,113,536
6Sep 6, 2026 03:167,05068,467,20157,485,0001,034,0002,113,536
7Sep 6, 2026 03:167,06168,491,96657,607,0001,005,0002,113,536
8Sep 6, 2026 03:167,13469,058,47358,191,0001,027,0002,113,536
9Sep 6, 2026 03:167,16169,405,06158,411,0001,028,0002,113,536