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 listJun 28, 2026 07:24Shikhar SoniShikhar SoniScore: 9,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:249,54588,646,61272,168,0007,063,0002,121,728
2Jun 28, 2026 07:249,55188,698,13272,089,0007,188,0002,121,728
3Jun 28, 2026 07:249,57888,878,79372,464,0007,036,0002,117,632
4Jun 28, 2026 07:249,61389,667,06872,365,0007,424,0002,117,632
5Jun 28, 2026 07:249,65189,838,23972,811,0007,295,0002,121,728
6Jun 28, 2026 07:249,72090,556,45773,350,0007,329,0002,117,632
7Jun 28, 2026 07:249,74390,306,69274,450,0006,418,0002,121,728
8Jun 28, 2026 07:249,76390,792,71874,069,0006,964,0002,121,728
9Jun 28, 2026 07:2410,16393,858,54176,801,0007,560,0002,121,728