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 listNov 3, 2026 01:39Andrew EpsteinAndrew EpsteinScore: 56,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 02:0556,041474,488,642463,129,0002,018,0002,121,728stderr
2Nov 3, 2026 02:0556,244476,203,372464,821,0002,005,0002,121,728stderr
3Nov 3, 2026 02:0556,398477,317,894466,097,0002,009,0002,121,728stderr
4Nov 3, 2026 02:0556,485478,258,367466,821,0002,012,0002,121,728stderr
5Nov 3, 2026 02:0556,543479,031,302467,313,0002,002,0002,121,728stderr
6Nov 3, 2026 02:0556,564479,209,621467,475,0002,010,0002,121,728stderr
7Nov 3, 2026 02:0556,585479,283,757467,654,0002,009,0002,121,728stderr
8Nov 3, 2026 02:0556,593479,445,629467,711,0002,018,0002,121,728stderr
9Nov 3, 2026 02:0556,748480,801,371469,002,0002,008,0002,121,728stderr