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 12, 2026 14:18boop34boop34Score: 23,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 12, 2026 14:1923,262202,768,256192,066,0001,010,0002,113,536
2Jul 12, 2026 14:1923,268202,845,813192,114,0001,011,0002,113,536
3Jul 12, 2026 14:1923,823207,392,346196,724,0001,009,0002,113,536
4Jul 12, 2026 14:1923,843208,179,441196,894,0001,010,0002,113,536
5Jul 12, 2026 14:1923,843208,242,115195,866,0002,032,0002,113,536
6Jul 12, 2026 14:1923,852209,844,000195,934,0002,043,0002,113,536
7Jul 12, 2026 14:1923,856208,932,669195,971,0002,038,0002,113,536
8Jul 12, 2026 14:1923,859208,372,139196,021,0002,013,0002,113,536
9Jul 12, 2026 14:1923,875208,346,738196,158,0002,012,0002,113,536