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 listMay 7, 2026 10:26wnwnScore: 3,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:273,42943,775,77427,400,0001,068,0002,478,080
2May 7, 2026 10:273,43147,135,76827,432,0001,053,0002,482,176
3May 7, 2026 10:273,43244,012,29227,439,0001,051,0002,482,176
4May 7, 2026 10:273,43242,559,87927,422,0001,066,0002,486,272
5May 7, 2026 10:273,43843,939,86327,487,0001,052,0002,486,272
6May 7, 2026 10:273,44742,602,13427,552,0001,062,0002,494,464
7May 7, 2026 10:273,44943,587,82627,544,0001,084,0002,486,272
8May 7, 2026 10:273,45143,642,68927,587,0001,064,0002,482,176
9May 7, 2026 10:273,47047,072,83727,723,0001,085,0002,482,176