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 listSep 17, 2026 01:35Andrew EpsteinAndrew EpsteinScore: 6,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:366,80276,856,38055,270,0001,193,0002,117,632stderr
2Sep 17, 2026 01:366,83176,966,36755,559,0001,145,0002,117,632stderr
3Sep 17, 2026 01:366,86678,298,38955,807,0001,185,0002,117,632stderr
4Sep 17, 2026 01:366,87277,311,64655,904,0001,140,0002,117,632stderr
5Sep 17, 2026 01:366,88977,463,16856,038,0001,141,0002,117,632stderr
6Sep 17, 2026 01:366,89377,507,18256,036,0001,179,0002,117,632stderr
7Sep 17, 2026 01:366,91977,796,02156,272,0001,163,0002,117,632stderr
8Sep 17, 2026 01:366,95878,040,09956,564,0001,195,0002,117,632stderr
9Sep 17, 2026 01:366,97678,172,43256,750,0001,153,0002,117,632stderr