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 listSep 17, 2026 01:21Andrew EpsteinAndrew EpsteinScore: 81,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:2281,014682,574,135669,012,0003,408,0002,117,632stderr
2Sep 17, 2026 01:2281,055683,050,523669,429,0003,334,0002,117,632stderr
3Sep 17, 2026 01:2281,303685,097,996671,478,0003,340,0002,117,632stderr
4Sep 17, 2026 01:2281,386686,504,439671,940,0003,570,0002,117,632stderr
5Sep 17, 2026 01:2281,711688,483,884674,859,0003,347,0002,117,632stderr
6Sep 17, 2026 01:2281,773688,954,991675,366,0003,351,0002,117,632stderr
7Sep 17, 2026 01:2282,371693,999,056680,266,0003,418,0002,117,632stderr
8Sep 17, 2026 01:2282,720696,847,921683,145,0003,433,0002,117,632stderr
9Sep 17, 2026 01:2282,734697,069,828683,351,0003,345,0002,117,632stderr