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 listMar 12, 2026 00:32Sergey SerebryakovSergey SerebryakovScore: 7,569Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 00:327,10484,529,96356,962,0001,998,0002,277,376
2Mar 12, 2026 00:327,12478,029,75457,125,0002,004,0002,273,280
3Mar 12, 2026 00:327,13385,045,46358,204,0001,003,0002,277,376
4Mar 12, 2026 00:327,56986,628,22760,828,0001,994,0002,277,376
5Mar 12, 2026 00:327,57383,551,76460,863,0001,995,0002,445,312
6Mar 12, 2026 00:327,63784,112,64362,381,0001,006,0002,445,312