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 listJul 12, 2026 17:08Kevin HeaveyKevin HeaveyScore: 4,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 17:134,02143,046,39932,122,0001,255,0002,117,632
2Jul 12, 2026 17:134,02943,075,79732,428,0001,020,0002,117,632
3Jul 12, 2026 17:134,03443,101,47132,468,0001,019,0002,117,632
4Jul 12, 2026 17:134,03543,176,89332,466,0001,027,0002,117,632
5Jul 12, 2026 17:134,08343,538,70932,588,0001,302,0002,117,632
6Jul 12, 2026 17:134,08743,592,33232,887,0001,041,0002,117,632
7Jul 12, 2026 17:134,09043,544,04532,905,0001,042,0002,117,632
8Jul 12, 2026 17:134,09244,157,93232,925,0001,040,0002,117,632
9Jul 12, 2026 17:134,09343,851,94032,937,0001,042,0002,117,632