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 listSep 24, 2026 13:28wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 13:280169,943,988159,474,0001,007,0002,113,536expected "53686324037969063 ", got "18446744073709551034 53686324037969063 524127039 0 27816924 26408221 26211513 26378493 26212034 26371024 "
2Sep 24, 2026 13:280170,230,282160,393,0001,003,0002,113,536expected "53687766012013555 ", got "18446744073709551034 53687766012013555 524131368 0 28532510 26240290 26493041 26210292 26500001 26211424 "
3Sep 24, 2026 13:280169,112,362159,424,0001,022,0002,113,536expected "53679521680783281 ", got "18446744073709551034 53679521680783281 524124102 0 28070682 26217380 26315617 26211945 26294526 26228975 "