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 03:34Andrew EpsteinAndrew EpsteinScore: 36,354Success
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 03:4136,091308,994,398297,533,0002,023,0002,121,728stderr
2Nov 3, 2026 03:4136,205309,848,495298,488,0002,014,0002,121,728stderr
3Nov 3, 2026 03:4136,275310,454,584299,075,0002,013,0002,121,728stderr
4Nov 3, 2026 03:4136,294310,564,219299,217,0002,031,0002,121,728stderr
5Nov 3, 2026 03:4136,354311,154,086299,741,0002,005,0002,121,728stderr
6Nov 3, 2026 03:4136,387311,810,812300,005,0002,009,0002,121,728stderr
7Nov 3, 2026 03:4136,451311,922,235300,535,0002,013,0002,121,728stderr
8Nov 3, 2026 03:4136,473312,195,002300,727,0002,005,0002,121,728stderr
9Nov 3, 2026 03:4136,485312,234,304300,823,0002,005,0002,121,728stderr