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 9, 2026 20:55Daniel MastalerzDaniel MastalerzScore: 9,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 20:559,475104,397,87173,666,0004,977,0002,404,352
2Feb 9, 2026 20:559,614105,193,03773,810,0005,984,0002,314,240
3Feb 9, 2026 20:559,617103,755,16774,836,0004,989,0002,330,624
4Feb 9, 2026 20:559,659108,176,57579,170,0001,002,0002,314,240
5Feb 9, 2026 20:559,673110,038,10476,274,0004,014,0002,408,448
6Feb 9, 2026 20:559,680107,347,35274,320,0006,025,0002,457,600