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:08CheckHarryCheckHarryScore: 4,127Success
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:094,11044,026,80733,093,0001,024,0002,113,536
2Sep 6, 2026 03:094,11243,946,35433,123,0001,011,0002,113,536
3Sep 6, 2026 03:094,11244,072,43533,123,0001,008,0002,113,536
4Sep 6, 2026 03:094,11644,115,89233,159,0001,010,0002,113,536
5Sep 6, 2026 03:094,12744,060,28333,249,0001,008,0002,113,536
6Sep 6, 2026 03:094,13544,137,36933,305,0001,017,0002,113,536
7Sep 6, 2026 03:094,17544,563,62333,642,0001,011,0002,113,536
8Sep 6, 2026 03:094,25745,257,32234,333,0001,007,0002,113,536
9Sep 6, 2026 03:094,27345,314,92734,447,0001,023,0002,113,536