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 08:04CheckHarryCheckHarryScore: 4,210Success
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 08:054,19844,761,63733,841,0001,009,0002,113,536
2Sep 6, 2026 08:054,20444,834,51233,882,0001,012,0002,113,536
3Sep 6, 2026 08:054,20646,068,95533,899,0001,018,0002,113,536
4Sep 6, 2026 08:054,20844,808,15833,926,0001,008,0002,113,536
5Sep 6, 2026 08:054,21044,817,50533,938,0001,011,0002,113,536
6Sep 6, 2026 08:054,21044,790,39933,937,0001,012,0002,113,536
7Sep 6, 2026 08:054,21344,792,68933,950,0001,023,0002,113,536
8Sep 6, 2026 08:054,29945,579,99734,640,0001,047,0002,113,536
9Sep 6, 2026 08:054,34545,954,84735,059,0001,011,0002,113,536