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 21, 2026 14:11Daniel MastalerzDaniel MastalerzScore: 5,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:115,66274,254,15842,998,0003,999,0002,265,088
2Feb 21, 2026 14:115,68070,089,70344,132,0003,009,0002,285,568
3Feb 21, 2026 14:115,69669,536,86743,251,0004,023,0002,265,088
4Feb 21, 2026 14:115,72272,921,14743,453,0004,042,0002,269,184
5Feb 21, 2026 14:115,76075,792,78143,822,0003,983,0002,265,088
6Feb 21, 2026 14:115,76476,839,33643,856,0003,986,0002,310,144
7Feb 21, 2026 14:115,76675,307,31642,875,0004,985,0002,310,144
8Feb 21, 2026 14:115,76971,659,33243,892,0003,990,0002,265,088
9Feb 21, 2026 14:115,77273,272,07841,916,0005,988,0002,310,144
10Feb 21, 2026 14:115,78274,851,67643,989,0003,999,0002,269,184
11Feb 21, 2026 14:115,86878,401,85946,674,0002,029,0002,523,136
12Feb 21, 2026 14:116,00274,464,54647,827,0001,992,0002,514,944