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 30, 2026 16:01CodeReclaimersCodeReclaimersScore: 18,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 16:0118,898166,904,951155,849,0001,005,0002,113,536
2Jul 30, 2026 16:0118,915167,084,565155,731,0001,269,0002,113,536
3Jul 30, 2026 16:0118,943167,242,699156,223,0001,008,0002,113,536
4Jul 30, 2026 16:0118,950168,075,927156,042,0001,248,0002,113,536
5Jul 30, 2026 16:0118,952168,163,172156,059,0001,246,0002,113,536
6Jul 30, 2026 16:0118,956168,230,382156,338,0001,004,0002,113,536
7Jul 30, 2026 16:0118,985167,648,554156,573,0001,003,0002,113,536
8Jul 30, 2026 16:0119,008167,885,117156,517,0001,255,0002,113,536
9Jul 30, 2026 16:0119,022168,058,504156,636,0001,253,0002,113,536