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 18, 2026 21:13Aleksei ShahoikaAleksei ShahoikaScore: 12,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 21:1312,479114,977,78682,422,00021,159,0002,113,536
2May 18, 2026 21:1312,548115,382,55982,775,00021,377,0002,113,536
3May 18, 2026 21:1312,554115,336,57583,041,00021,158,0002,113,536
4May 18, 2026 21:1312,558115,500,22582,756,00021,478,0002,117,632
5May 18, 2026 21:1312,569115,475,08283,040,00021,286,0002,113,536
6May 18, 2026 21:1312,589116,648,77883,090,00021,406,0002,113,536
7May 18, 2026 21:1312,630115,917,13482,527,00022,303,0002,113,536
8May 18, 2026 21:1312,643118,338,77382,980,00021,958,0002,113,536
9May 18, 2026 21:1312,728118,056,49383,564,00022,084,0002,113,536