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 22, 2026 10:55wnwnScore: 3,511Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:563,42041,139,60127,380,0001,014,0002,314,240
2Apr 22, 2026 10:563,45645,666,50627,664,0001,024,0002,330,624
3Apr 22, 2026 10:563,47840,793,26026,881,0001,991,0002,473,984
4Apr 22, 2026 10:563,50447,892,65927,085,0002,006,0002,482,176
5Apr 22, 2026 10:563,51142,998,72928,141,0001,005,0002,498,560
6Apr 22, 2026 10:563,51743,029,00429,198,00002,490,368
7Apr 22, 2026 10:563,57643,890,23428,662,0001,023,0002,486,272
8Apr 22, 2026 10:563,59244,969,49027,829,0001,987,0002,482,176
9Apr 22, 2026 10:563,62945,704,15628,113,0002,008,0002,473,984