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 listFeb 5, 2026 15:27howenhowenScore: 90,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 15:2790,783781,344,458522,654,000230,847,0002,285,568
2Feb 5, 2026 15:2790,809780,583,243521,804,000231,912,0002,514,944
3Feb 5, 2026 15:2790,814780,070,796520,832,000232,924,0002,461,696
4Feb 5, 2026 15:2790,898780,461,789520,622,000233,830,0002,527,232
5Feb 5, 2026 15:2790,929782,694,316520,799,000233,910,0002,285,568
6Feb 5, 2026 15:2791,231787,430,298520,460,000236,754,0002,285,568
7Feb 5, 2026 15:2791,271781,458,516520,691,000236,859,0002,277,376
8Feb 5, 2026 15:2791,343783,559,142521,416,000236,735,0002,301,952
9Feb 5, 2026 15:2791,826785,075,867520,423,000241,732,0002,498,560