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 listApr 21, 2026 10:01BenBenScore: 23,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:0123,627226,500,429186,107,00010,005,0002,330,624
2Apr 21, 2026 10:0123,631219,557,000188,134,0008,005,0002,269,184
3Apr 21, 2026 10:0123,678229,342,517184,496,00012,032,0002,330,624
4Apr 21, 2026 10:0123,696230,092,379183,706,00012,979,0002,322,432
5Apr 21, 2026 10:0123,697229,446,081182,709,00013,977,0002,314,240
6Apr 21, 2026 10:0123,709228,574,270186,796,0009,989,0002,338,816
7Apr 21, 2026 10:0123,767224,457,796183,250,00014,019,0002,277,376
8Apr 21, 2026 10:0123,784221,627,647195,411,0002,004,0002,334,720
9Apr 21, 2026 10:0123,902221,505,236188,370,00010,019,0002,363,392