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 listMay 7, 2026 08:04ふぃぼふぃぼScore: 425,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:04424,3183,537,658,4483,398,207,000123,637,0002,383,872
2May 7, 2026 08:04424,5673,543,685,3223,398,032,000125,879,0002,379,776
3May 7, 2026 08:04425,4313,546,553,2453,406,464,000124,621,0002,379,776
4May 7, 2026 08:04425,7223,551,859,3843,401,432,000132,061,0002,453,504
5May 7, 2026 08:04425,9913,550,942,4373,412,455,000123,275,0002,375,680
6May 7, 2026 08:04426,2173,557,124,8833,414,125,000123,478,0002,371,584
7May 7, 2026 08:04427,1683,563,333,6943,422,524,000122,972,0002,387,968
8May 7, 2026 08:04428,7303,575,683,5073,435,728,000122,739,0002,375,680
9May 7, 2026 08:04433,8413,616,520,5553,475,725,000125,157,0002,375,680