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 11:52Andrew EpsteinAndrew EpsteinScore: 36,970Success
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 11:5236,755314,248,382303,064,0002,009,0002,125,824stderr
2Nov 3, 2026 11:5236,870315,411,041304,015,0002,008,0002,125,824stderr
3Nov 3, 2026 11:5236,906315,638,152304,313,0002,013,0002,129,920stderr
4Nov 3, 2026 11:5236,939315,942,872304,585,0002,014,0002,121,728stderr
5Nov 3, 2026 11:5236,970316,205,212304,837,0002,021,0002,125,824stderr
6Nov 3, 2026 11:5236,972316,312,167304,865,0002,008,0002,125,824stderr
7Nov 3, 2026 11:5237,040316,723,456305,428,0002,009,0002,121,728stderr
8Nov 3, 2026 11:5237,067317,153,336305,644,0002,020,0002,121,728stderr
9Nov 3, 2026 11:5237,095317,119,106305,880,0002,015,0002,125,824stderr