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 29, 2026 13:13TudyMTudyMScore: 35,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:1435,189306,821,856290,073,0002,000,0002,437,120
2Apr 29, 2026 13:1435,196309,271,489291,130,0001,000,0002,306,048
3Apr 29, 2026 13:1435,202307,333,364291,184,0001,000,0002,375,680
4Apr 29, 2026 13:1435,203306,402,460289,187,0003,001,0002,383,872
5Apr 29, 2026 13:1435,203311,166,170291,193,0001,000,0002,379,776
6Apr 29, 2026 13:1435,206311,905,709291,213,0001,000,0002,392,064
7Apr 29, 2026 13:1435,222307,005,902289,344,0003,003,0002,379,776
8Apr 29, 2026 13:1435,224312,088,280291,360,0001,001,0002,387,968
9Apr 29, 2026 13:1435,233314,531,952291,436,0001,001,0002,383,872