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:07CheckHarryCheckHarryScore: 3,860Success
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:083,84641,799,03130,916,0001,012,0002,113,536
2Sep 6, 2026 03:083,84641,835,78430,921,0001,009,0002,113,536
3Sep 6, 2026 03:083,85141,821,42730,954,0001,012,0002,113,536
4Sep 6, 2026 03:083,85541,857,39030,982,0001,018,0002,113,536
5Sep 6, 2026 03:083,86041,915,16231,031,0001,008,0002,113,536
6Sep 6, 2026 03:083,87142,057,67631,098,0001,039,0002,113,536
7Sep 6, 2026 03:083,87950,987,30631,138,0001,060,0002,113,536
8Sep 6, 2026 03:083,88552,378,97431,192,0001,056,0002,113,536
9Sep 6, 2026 03:083,94542,636,13831,729,0001,016,0002,113,536