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 18, 2026 10:15wnwnScore: 7,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:166,26773,702,31250,012,0002,000,0002,473,984
2Feb 18, 2026 10:156,33877,655,73150,583,0002,023,0002,519,040
3Feb 18, 2026 10:166,36080,085,54748,805,0003,984,0002,379,776
4Feb 18, 2026 10:166,37583,131,83549,918,0002,995,0002,387,968
5Feb 18, 2026 10:156,38582,050,50349,995,0002,999,0002,494,464
6Feb 18, 2026 10:156,43076,762,41251,358,0002,014,0002,347,008
7Feb 18, 2026 10:167,22884,187,42456,993,0002,999,0002,379,776
8Feb 18, 2026 10:157,27092,721,59058,334,0002,011,0002,420,736
9Feb 18, 2026 10:167,34083,857,72457,924,0002,996,0002,293,760
10Feb 18, 2026 10:157,35389,570,47857,032,0004,002,0002,428,928
11Feb 18, 2026 10:167,38583,706,29858,283,0003,014,0002,441,216
12Feb 18, 2026 10:157,47785,114,71061,055,0001,000,0002,457,600