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 17, 2026 23:47Aleksei ShahoikaAleksei ShahoikaScore: 13,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:4712,900117,759,47691,163,00015,913,0002,113,536
2May 17, 2026 23:4712,943118,050,65190,981,00016,454,0002,113,536
3May 17, 2026 23:4712,955117,315,25991,104,00016,427,0002,113,536
4May 17, 2026 23:4713,012119,787,38791,132,00016,869,0002,113,536
5May 17, 2026 23:4713,058120,863,02791,189,00017,194,0002,113,536
6May 17, 2026 23:4713,106120,443,55791,004,00017,780,0002,113,536
7May 17, 2026 23:4713,137120,822,48691,195,00017,849,0002,113,536
8May 17, 2026 23:4713,249122,251,12991,934,00018,034,0002,113,536
9May 17, 2026 23:4713,279121,685,50991,123,00019,096,0002,113,536