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 listMar 17, 2026 15:00Yuriy LyfenkoYuriy LyfenkoScore: 8,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 15:008,657100,495,76959,876,00011,975,0002,486,272
2Mar 17, 2026 15:008,66397,947,37462,915,0008,987,0002,412,544
3Mar 17, 2026 15:008,664103,300,37462,923,0008,989,0002,351,104