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 8, 2026 09:09chereshnya123chereshnya123Score: 61,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 09:0961,193516,893,524451,072,00056,830,0002,113,536
2Jun 8, 2026 09:0961,255517,583,881451,150,00057,273,0002,113,536
3Jun 8, 2026 09:0961,277517,756,363450,937,00057,668,0002,113,536
4Jun 8, 2026 09:0961,311518,079,130451,009,00057,879,0002,113,536
5Jun 8, 2026 09:0961,314518,035,065451,117,00057,791,0002,113,536
6Jun 8, 2026 09:0961,431519,033,911451,130,00058,751,0002,113,536
7Jun 8, 2026 09:0961,463519,250,308451,193,00058,955,0002,113,536
8Jun 8, 2026 09:0961,468519,289,644450,987,00059,201,0002,113,536
9Jun 8, 2026 09:0961,470519,366,083451,110,00059,096,0002,113,536