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 16, 2026 13:50Kevin HeaveyKevin HeaveyScore: 3,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 13:513,90642,193,50231,398,0001,027,0002,117,632
2Jul 16, 2026 13:513,91642,321,63531,482,0001,023,0002,117,632
3Jul 16, 2026 13:513,92442,319,33531,547,0001,030,0002,117,632
4Jul 16, 2026 13:513,93342,441,75131,617,0001,035,0002,117,632
5Jul 16, 2026 13:513,93742,379,51531,655,0001,025,0002,117,632
6Jul 16, 2026 13:513,94442,403,42631,717,0001,023,0002,117,632
7Jul 16, 2026 13:513,94743,061,84931,718,0001,043,0002,117,632
8Jul 16, 2026 13:513,95542,522,10231,788,0001,043,0002,117,632
9Jul 16, 2026 13:513,96942,655,46931,903,0001,045,0002,117,632