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 listFeb 6, 2025 14:03mebowlermebowlerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 14:0300000Error: Exit with code 2: unexpected fault address 0x7ac018600000 fatal error: fault [signal SIGSEGV: segmentation violation code=0x2 addr=0x7ac018600000 pc=0x569c9c514852] goroutine 1 gp=0xc0000061c0 m=0 mp=0x569c9c63d740 [running]: runtime.throw({0x5...stderr