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 26, 2026 16:11wnwnScore: 3,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:123,41247,872,77627,316,0001,011,0002,326,528
2Apr 26, 2026 16:123,41448,085,26627,331,0001,012,0002,482,176
3Apr 26, 2026 16:123,43645,973,85027,506,0001,018,0002,322,432
4Apr 26, 2026 16:123,44944,130,07627,608,0001,022,0002,330,624
5Apr 26, 2026 16:123,45144,373,47127,625,0001,023,0002,490,368
6Apr 26, 2026 16:123,45746,474,03827,673,0001,024,0002,490,368
7Apr 26, 2026 16:123,46241,759,67327,747,000990,0002,555,904
8Apr 26, 2026 16:123,57243,233,06428,631,0001,022,0002,490,368
9Apr 26, 2026 16:123,58442,965,89327,770,0001,983,0002,490,368