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 19:32lipapipalipapipaScore: 6,757Success
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:386,54477,977,45552,302,0002,011,0002,334,720
2Feb 18, 2026 19:326,58582,115,03153,643,0001,012,0002,428,928
3Feb 18, 2026 19:326,63082,161,05952,030,0003,001,0002,260,992
4Feb 17, 2026 22:386,66080,644,81952,264,0003,015,0002,498,560
5Feb 18, 2026 19:326,66081,916,14652,267,0003,015,0002,326,528
6Feb 17, 2026 22:386,73478,224,08053,894,0001,996,0002,502,656
7Feb 17, 2026 22:386,75778,627,20253,075,0003,004,0002,494,464
8Feb 17, 2026 22:386,76175,199,34252,112,0004,008,0002,502,656
9Feb 17, 2026 22:386,79679,042,45054,392,0002,014,0002,301,952
10Feb 18, 2026 19:326,82977,494,60755,672,0001,012,0002,318,336
11Feb 18, 2026 19:326,86479,971,47354,975,0001,999,0002,326,528
12Feb 18, 2026 19:326,89678,485,98555,231,0002,008,0002,506,752