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 listApr 26, 2026 13:32wnwnScore: 3,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:333,43549,745,44627,498,0001,018,0002,482,176
2Apr 26, 2026 13:333,44350,126,44228,583,00002,490,368
3Apr 26, 2026 13:333,44546,229,39627,576,0001,021,0002,498,560
4Apr 26, 2026 13:333,45141,852,51127,621,0001,023,0002,478,080
5Apr 26, 2026 13:333,45645,807,04427,666,0001,024,0002,482,176
6Apr 26, 2026 13:333,46348,646,16327,721,0001,026,0002,490,368
7Apr 26, 2026 13:333,57145,700,71028,618,0001,022,0002,490,368
8Apr 26, 2026 13:333,62844,935,85428,109,0002,007,0002,473,984
9Apr 26, 2026 13:333,91753,458,96430,545,0001,970,0002,293,760