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 2, 2026 18:26A_ShamanA_ShamanScore: 37,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:2637,072317,783,651306,693,0001,005,0002,113,536
2Jul 2, 2026 18:2637,076317,947,238306,734,0001,005,0002,113,536
3Jul 2, 2026 18:2637,079317,836,868305,736,0002,027,0002,113,536
4Jul 2, 2026 18:2637,083317,323,907306,790,0001,004,0002,113,536
5Jul 2, 2026 18:2637,085319,269,473305,673,0002,133,0002,113,536
6Jul 2, 2026 18:2637,087317,726,566306,820,0001,006,0002,113,536
7Jul 2, 2026 18:2637,087317,316,019306,824,0001,004,0002,113,536
8Jul 2, 2026 18:2637,109317,627,766307,004,0001,005,0002,113,536
9Jul 2, 2026 18:2637,121317,850,037306,089,0002,016,0002,113,536