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 24, 2026 03:27wnwnScore: 4,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:313,92941,427,72627,267,0005,345,0002,113,536
2Sep 24, 2026 03:314,00441,954,61627,197,0006,044,0002,113,536
3Sep 24, 2026 03:314,10942,907,78327,348,0006,764,0002,113,536
4Sep 24, 2026 03:314,11842,922,02827,197,0006,985,00020,480
5Sep 24, 2026 03:314,13643,755,54028,978,0005,356,0002,113,536
6Sep 24, 2026 03:314,18043,453,71727,239,0007,459,00020,480
7Sep 24, 2026 03:314,22043,855,61427,394,0007,636,0002,113,536
8Sep 24, 2026 03:314,23443,880,76527,265,0007,880,0002,113,536
9Sep 24, 2026 03:314,28044,336,83028,271,0007,261,00020,480