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 27, 2026 04:47wnwnScore: 3,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:473,41646,272,47827,342,0001,012,0002,478,080
2Apr 27, 2026 04:473,43046,224,50727,458,0001,016,0002,494,464
3Apr 27, 2026 04:473,43145,633,02527,462,0001,017,0002,478,080
4Apr 27, 2026 04:473,46148,087,24127,702,0001,026,0002,490,368
5Apr 27, 2026 04:473,46645,759,44426,790,0001,984,0002,330,624
6Apr 27, 2026 04:473,47646,971,28126,864,0001,989,0002,490,368
7Apr 27, 2026 04:473,48442,025,81726,924,0001,994,0002,498,560
8Apr 27, 2026 04:473,51141,612,77927,135,0002,010,0002,490,368
9Apr 27, 2026 04:473,59547,329,13927,851,0001,989,0002,478,080