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 listFeb 17, 2026 19:31wnwnScore: 7,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:316,15573,726,28948,084,0003,005,0002,285,568
2Feb 17, 2026 19:316,16072,075,33948,117,0003,007,0002,498,560
3Feb 17, 2026 19:316,22279,027,57849,615,0002,025,0002,482,176
4Feb 17, 2026 19:317,23685,861,83556,052,0004,003,0002,277,376
5Feb 17, 2026 19:317,29389,213,16258,517,0002,017,0002,387,968
6Feb 17, 2026 19:317,87989,320,79163,384,0002,012,0002,502,656