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 listMar 8, 2026 19:05wnwnScore: 4,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 19:054,43765,007,78134,833,0001,990,0002,273,280
2Mar 8, 2026 19:074,43961,288,56734,856,0001,991,0002,273,280
3Mar 8, 2026 19:074,44462,596,94634,889,0001,993,0002,273,280
4Mar 8, 2026 19:054,44662,121,95734,907,0001,994,0002,527,232
5Mar 8, 2026 19:074,46458,870,24335,048,0002,002,0002,273,280
6Mar 8, 2026 19:054,52760,035,19835,543,0002,031,0002,269,184