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 listApr 2, 2026 01:39zielajzielajScore: 3,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 01:403,41554,561,51127,331,0001,012,0002,428,928
2Apr 2, 2026 01:403,42854,226,37727,434,0001,016,0002,478,080
3Apr 2, 2026 01:403,43865,465,95327,516,0001,019,0002,482,176
4Apr 2, 2026 01:393,59360,191,01327,831,0001,987,0002,433,024
5Apr 2, 2026 01:393,59861,207,82027,875,0001,991,0002,482,176
6Apr 2, 2026 01:393,60860,183,76127,948,0001,996,0002,482,176