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 listMay 10, 2026 11:32wnwnScore: 3,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:333,38844,602,85827,078,0001,050,0002,482,176
2May 10, 2026 11:333,40741,984,05327,235,0001,046,0002,473,984
3May 10, 2026 11:333,54746,289,94928,381,0001,062,0002,486,272
4May 10, 2026 11:333,56246,536,34328,511,0001,055,0002,490,368
5May 10, 2026 11:333,57043,338,38028,563,0001,068,0002,482,176
6May 10, 2026 11:333,57644,175,85428,617,0001,066,0002,486,272
7May 10, 2026 11:333,59143,960,68828,754,0001,058,0002,469,888
8May 10, 2026 11:333,59845,321,73928,779,0001,087,0002,486,272
9May 10, 2026 11:333,61148,261,26728,896,0001,082,0002,486,272