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 23, 2026 01:23Kevin HeaveyKevin HeaveyScore: 4,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 01:243,96642,700,11030,638,0002,281,0002,113,536
2Jul 23, 2026 01:244,00043,010,68730,812,0002,396,0002,113,536
3Jul 23, 2026 01:244,02243,170,81930,962,0002,426,0002,113,536
4Jul 23, 2026 01:244,03943,291,94131,190,0002,338,0002,113,536
5Jul 23, 2026 01:244,06243,452,17131,310,0002,405,0002,113,536
6Jul 23, 2026 01:244,06743,504,79631,265,0002,498,0002,113,536
7Jul 23, 2026 01:244,06943,519,53731,297,0002,482,0002,113,536
8Jul 23, 2026 01:244,09143,614,80431,372,0002,586,0002,113,536
9Jul 23, 2026 01:2472,438611,025,587599,224,0002,012,0002,113,536