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:29Shikhar SoniShikhar SoniScore: 9,662Success
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:299,52988,556,79372,297,0006,795,0002,121,728
2Jun 28, 2026 07:299,57088,976,65672,461,0006,978,0002,117,632
3Jun 28, 2026 07:299,60289,130,43972,764,0006,938,0002,125,824
4Jun 28, 2026 07:299,65289,566,83373,015,0007,104,0002,125,824
5Jun 28, 2026 07:299,66290,063,15972,985,0007,210,0002,121,728
6Jun 28, 2026 07:299,66890,027,63973,012,0007,238,0002,121,728
7Jun 28, 2026 07:299,71490,496,17273,440,0007,193,0002,117,632
8Jun 28, 2026 07:299,72890,174,44373,504,0007,244,0002,117,632
9Jun 28, 2026 07:299,77190,603,66273,822,0007,282,0002,121,728