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 2, 2026 09:57lipapipalipapipaScore: 6,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 09:576,09181,258,33249,547,0001,011,0002,293,760
2Mar 2, 2026 09:576,09779,241,28549,594,0001,012,0002,293,760
3Mar 2, 2026 09:576,10382,619,84948,631,0002,026,0002,269,184
4Mar 2, 2026 09:576,27279,100,24249,054,0003,003,0002,273,280
5Mar 2, 2026 09:576,32176,994,24851,453,0001,008,0002,289,664
6Mar 2, 2026 09:576,32675,223,72750,484,0002,019,0002,281,472