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 27, 2026 03:16Kevin HeaveyKevin HeaveyScore: 7,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 03:177,16969,618,28347,562,00011,944,00020,480
2Jul 27, 2026 03:177,39371,451,45548,090,00013,277,00020,480
3Jul 27, 2026 03:177,40773,513,26947,996,00013,485,00020,480
4Jul 27, 2026 03:177,44371,781,98448,353,00013,424,00020,480
5Jul 27, 2026 03:177,84375,190,05949,197,00015,903,0002,113,536
6Jul 27, 2026 03:177,85975,332,72848,578,00016,653,00020,480
7Jul 27, 2026 03:177,87075,331,09948,020,00017,301,0002,113,536
8Jul 27, 2026 03:177,89675,608,52848,287,00017,255,0002,113,536
9Jul 27, 2026 03:178,01676,686,43648,468,00018,066,0002,113,536