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 17, 2026 22:07Daniel MastalerzDaniel MastalerzScore: 6,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 22:076,56076,228,76752,430,0002,016,0002,301,952
2Feb 17, 2026 22:076,56075,514,35553,442,0001,008,0002,301,952
3Feb 17, 2026 22:076,57883,413,53851,567,0003,033,0002,301,952
4Feb 17, 2026 22:076,69682,527,72453,557,0002,021,0002,293,760
5Feb 17, 2026 22:076,70083,514,80453,591,0002,022,0002,293,760
6Feb 17, 2026 22:076,70288,124,71953,608,0002,022,0002,400,256