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 10:12wnwnScore: 3,487Success
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 10:133,39042,805,64327,063,0001,074,0002,486,272
2May 10, 2026 10:133,39942,237,14927,175,0001,043,0002,482,176
3May 10, 2026 10:133,40445,381,70227,209,0001,049,0002,490,368
4May 10, 2026 10:133,47544,134,66327,746,0001,097,0002,486,272
5May 10, 2026 10:133,48742,841,05427,867,0001,078,0002,490,368
6May 10, 2026 10:133,56747,482,85628,523,0001,087,0002,482,176
7May 10, 2026 10:133,56944,189,46728,536,0001,094,0002,490,368
8May 10, 2026 10:133,57847,021,89828,643,0001,061,0002,473,984
9May 10, 2026 10:133,57946,014,79328,654,0001,053,0002,486,272