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 02:36CheckHarryCheckHarryScore: 4,672Success
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 02:374,64048,441,01337,506,0001,009,0002,113,536
2Sep 6, 2026 02:374,64948,591,43037,584,0001,007,0002,113,536
3Sep 6, 2026 02:374,66148,555,76937,679,0001,008,0002,113,536
4Sep 6, 2026 02:374,66848,645,02937,732,0001,013,0002,113,536
5Sep 6, 2026 02:374,67249,216,05537,692,0001,091,0002,113,536
6Sep 6, 2026 02:374,68148,723,59137,849,0001,009,0002,113,536
7Sep 6, 2026 02:374,88050,365,12439,490,0001,021,0002,113,536
8Sep 6, 2026 02:374,91250,654,05739,595,0001,180,0002,113,536
9Sep 6, 2026 02:374,91951,010,96539,677,0001,152,0002,113,536