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 17, 2026 20:53wnwnScore: 7,385Success
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 20:537,18688,223,32755,603,0004,043,0002,441,216
2Feb 17, 2026 20:537,22184,985,81258,939,000998,0002,478,080
3Feb 17, 2026 20:537,22284,031,90257,947,0001,998,0002,269,184
4Feb 17, 2026 20:537,23788,684,12157,060,0003,003,0002,281,472
5Feb 17, 2026 20:537,25086,175,39157,167,0003,008,0002,486,272
6Feb 17, 2026 20:537,38385,131,96657,261,0004,018,0002,400,256
7Feb 17, 2026 20:537,38583,802,32558,278,0003,014,0002,510,848
8Feb 17, 2026 20:537,39487,319,05158,355,0003,018,0002,428,928
9Feb 17, 2026 20:537,53692,422,13659,521,0003,026,0002,281,472
10Feb 17, 2026 20:537,58192,075,00159,925,0002,996,0002,494,464
11Feb 17, 2026 20:537,58587,555,40961,958,000999,0002,457,600
12Feb 17, 2026 20:537,62885,843,02460,299,0003,014,0002,445,312