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 listOct 24, 2026 04:00Nao MinamiNao MinamiScore: 32,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:0132,333279,320,122267,359,0001,005,0002,113,536
2Oct 24, 2026 04:0132,334279,340,373267,375,0001,004,0002,113,536
3Oct 24, 2026 04:0132,335279,362,019267,384,0001,003,0002,113,536
4Oct 24, 2026 04:0132,339279,883,087266,402,0002,015,0002,113,536
5Oct 24, 2026 04:0132,342280,030,848267,437,0001,005,0002,113,536
6Oct 24, 2026 04:0132,345281,043,272267,462,0001,005,0002,113,536
7Oct 24, 2026 04:0132,351280,940,132267,512,0001,006,0002,113,536
8Oct 24, 2026 04:0132,355279,592,639267,545,0001,004,0002,113,536
9Oct 24, 2026 04:0132,360280,059,309267,586,0001,005,0002,113,536