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 16, 2026 22:27Josu San MartinJosu San MartinScore: 5,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 22:144,95463,362,20038,111,0003,008,0002,297,856
2Apr 16, 2026 22:274,96468,459,97438,184,0003,014,0002,297,856
3Apr 16, 2026 22:144,98569,330,23338,345,0003,027,0002,297,856
4Apr 16, 2026 22:145,05070,826,01238,918,0002,993,0002,297,856
5Apr 16, 2026 22:275,05370,747,13838,945,0002,995,0002,297,856
6Apr 16, 2026 22:275,14870,183,92239,746,0002,980,0002,289,664